package com.aqie.medium.binarySearchTree;

import com.aqie.easy.structure.TreeNode;

/**
 * 173 二叉搜索树迭代器
 * 中序遍历：左 根 右
 * todo
 */
public class BSTIterator {
    public BSTIterator(TreeNode root) {

    }

    /** @return the next smallest number */
    public int next() {
        return 0;
    }

    /** @return whether we have a next smallest number */
    public boolean hasNext() {
        return false;
    }
}
